The Hardness of Approximating Hereditary Properties
نویسندگان
چکیده
We consider the following class of problems: Given a graph G, find a maximum vertex induced subgraph of G satisfying a nontrivial hereditary property π. We show that this problem cannot be approximated for any such property π, within a factor of n1−2 for any 2 > 0, unless NP = ZPP . This improves the result in [LY93] where it was shown that for any nontrivial hereditary property, the maximum subgraph problem cannot be approximated within a factor of 2 n) c for some c > 0, unless NP ⊆ QP .
منابع مشابه
Ideal Amenability of Banach Algebras and Some Hereditary Properties
Let A be a Banach algebra. A is called ideally amenable if for every closed ideal I of A, the first cohomology group of A with coefficients in I* is trivial. We investigate the closed ideals I for which H1 (A,I* )={0}, whenever A is weakly amenable or a biflat Banach algebra. Also we give some hereditary properties of ideal amenability.
متن کاملOn the Inapproximability of Vertex Cover on k-Partite k-Uniform Hypergraphs
Computing a minimum vertex cover in graphs and hypergraphs is a well-studied optimizaton problem. While intractable in general, it is well known that on bipartite graphs, vertex cover is polynomial time solvable. In this work, we study the natural extension of bipartite vertex cover to hypergraphs, namely finding a small vertex cover in kuniform k-partite hypergraphs, when the k-partition is gi...
متن کاملHereditary properties of amenability modulo an ideal of Banach algebras
In this paper we investigate some hereditary properties of amenability modulo an ideal of Banach algebras. We show that if $(e_alpha)_alpha$ is a bounded approximate identity modulo I of a Banach algebra A and X is a neo-unital modulo I, then $(e_alpha)_alpha$ is a bounded approximate identity for X. Moreover we show that amenability modulo an ideal of a Banach algebra A can be only considered ...
متن کاملApproximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques
We consider the problem of approximating the minmax value of a multiplayer game in strategic form. We argue that in 3-player games with 0-1 payoffs, approximating the minmax value within an additive constant smaller than ξ/2, where ξ = 3− √ 5 2 ≈ 0.382, is not possible by a polynomial time algorithm. This is based on assuming hardness of a version of the socalled planted clique problem in Erdős...
متن کاملStrengthened Hardness for Approximating Minimum Unique Game and Small Set Expansion
In this paper, the author puts forward a variation of Feige’s Hypothesis, which claims that it is hard on average refuting Unbalanced Max 3-XOR against biased assignments on a natural distribution. Under this hypothesis, the author strengthens the previous known hardness for approximating Minimum Unique Game, 5/4 − ǫ, by proving that Min 2-Lin-2 is hard to within 3/2 − ǫ and strengthens the pre...
متن کامل